全文获取类型
收费全文 | 92252篇 |
免费 | 17451篇 |
国内免费 | 12973篇 |
专业分类
电工技术 | 9745篇 |
技术理论 | 3篇 |
综合类 | 11618篇 |
化学工业 | 2247篇 |
金属工艺 | 1776篇 |
机械仪表 | 6388篇 |
建筑科学 | 1965篇 |
矿业工程 | 1284篇 |
能源动力 | 1784篇 |
轻工业 | 1095篇 |
水利工程 | 1453篇 |
石油天然气 | 1038篇 |
武器工业 | 1356篇 |
无线电 | 14572篇 |
一般工业技术 | 5691篇 |
冶金工业 | 2443篇 |
原子能技术 | 324篇 |
自动化技术 | 57894篇 |
出版年
2024年 | 622篇 |
2023年 | 3048篇 |
2022年 | 5259篇 |
2021年 | 5430篇 |
2020年 | 5095篇 |
2019年 | 3873篇 |
2018年 | 3428篇 |
2017年 | 3717篇 |
2016年 | 4182篇 |
2015年 | 4785篇 |
2014年 | 6348篇 |
2013年 | 5962篇 |
2012年 | 7257篇 |
2011年 | 7848篇 |
2010年 | 6363篇 |
2009年 | 6466篇 |
2008年 | 6749篇 |
2007年 | 7158篇 |
2006年 | 5739篇 |
2005年 | 4781篇 |
2004年 | 3799篇 |
2003年 | 3042篇 |
2002年 | 2334篇 |
2001年 | 1759篇 |
2000年 | 1528篇 |
1999年 | 1182篇 |
1998年 | 974篇 |
1997年 | 792篇 |
1996年 | 603篇 |
1995年 | 444篇 |
1994年 | 368篇 |
1993年 | 298篇 |
1992年 | 276篇 |
1991年 | 132篇 |
1990年 | 167篇 |
1989年 | 126篇 |
1988年 | 86篇 |
1987年 | 47篇 |
1986年 | 73篇 |
1985年 | 38篇 |
1984年 | 32篇 |
1983年 | 32篇 |
1982年 | 30篇 |
1980年 | 28篇 |
1965年 | 24篇 |
1964年 | 25篇 |
1963年 | 23篇 |
1959年 | 24篇 |
1957年 | 22篇 |
1955年 | 23篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
31.
铁路在交通运输行业有着举足轻重的地位,一旦列车发生故障将会导致严重的生命财产损失。由于列车发生故障的概率相对较低,因此难以捕获列车的故障样本。针对上述问题,提出了一种无监督学习的列车故障识别方法,通过检测列车音频信号来识别列车故障。该方法基于深度信念网络(DBN),利用小波包分解提取检测信号的特征向量并将其作为DBN的输入,待网络充分训练后,由训练好的DBN识别当前列车的运行状况。现场监测实验结果表明,该方法能够在无监督的条件下有效识别列车故障,保障了列车的运行安全。 相似文献
32.
利用计算机实现自动、准确的秀丽隐杆线虫(C.elegans)的各项形态学参数分析,至关重要的是从显微图像上分割出线虫体态,但由于显微镜下的图像噪声较多,线虫边缘像素与周围环境相似,而且线虫的体态具有鞭毛和其他附着物需要分离,多方面因素导致设计一个鲁棒性的C.elegans分割算法仍然面临着挑战。针对这些问题,提出了一种基于深度学习的线虫分割方法,通过训练掩模区域卷积神经网络(Mask R-CNN)学习线虫形态特征实现自动分割。首先,通过改进多级特征池化将高级语义特征与低级边缘特征融合,结合大幅度软最大损失(LMSL)损失算法改进损失计算;然后,改进非极大值抑制;最后,引入全连接融合分支等方法对分割结果进行进一步优化。实验结果表明,相比原始的Mask R-CNN,该方法平均精确率(AP)提升了4.3个百分点,平均交并比(mIOU)提升了4个百分点。表明所提出的深度学习分割方法能够有效提高分割准确率,在显微图像中更加精确地分割出线虫体。 相似文献
33.
为了更加准确地检测出图像中的显著性目标,提出了多先验融合的显著性目标检测算法。针对传统中心先验对偏离图像中心的显著性目标会出现检测失效的情况,提出在多颜色空间下求显著性目标的最小凸包交集来确定目标的大致位置,以凸包区域中心计算中心先验。同时通过融合策略将凸包区域中心先验、颜色对比先验和背景先验融合并集成到特征矩阵中。最后通过低秩矩阵恢复模型生成结果显著图。在公开数据集MSRA1000和ESSCD上的仿真实验结果表明,MPLRR能够得到清晰高亮的显著性目标视觉效果图,同时F,AUC,MAE等评价指标也比现有的许多方法有明显提升。 相似文献
34.
Optimal power flow with generation reallocation is a suitable method for better utilization of the existing system. In recent years, Flexible AC Transmission System (FACTS) devices, have led to the development of controllers that provide controllability and flexibility for power transmission. Out of the FACTS devices unified power flow controller (UPFC) is a versatile device, capable of controlling the power system parameters like voltage magnitude, phase angle and line impedance individually or simultaneously. The main aim of this paper is to minimize real power losses in a power system using BAT search algorithm without and with the presence of UPFC. Minimization of real power losses is done by considering the power generated by generator buses, voltage magnitudes at generator buses and reactive power injection from reactive power compensators. The proposed BAT algorithm based Optimal Power Flow (OPF) has been tested on a 5 bus test system and modified IEEE 30 bus system without and with UPFC. The results of the system with and without UPFC are compared in terms of active power losses in the transmission line using BAT algorithm. The obtained results are also compared with Genetic algorithm (GA). 相似文献
35.
36.
Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms. 相似文献
37.
In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model. 相似文献
38.
Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm. 相似文献
39.
This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation. 相似文献
40.
We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately. 相似文献